Extremal problems for parabolic systemswith time-varying lags
نویسندگان
چکیده
منابع مشابه
Polynomial-time approximation schemes for scheduling problems with time lags
We identify two classes of machine scheduling problems with time lags that possess Polynomial-Time Approximation Schemes (PTASs). These classes together, one for minimizing makespan and one for minimizing total completion time, include many well-studied time lag scheduling problems. The running times of these approximation schemes are polynomial in the number of jobs, but exponential in the num...
متن کاملSpace-time Domain Decomposition for Parabolic Problems Space-time Domain Decomposition for Parabolic Problems
We analyze a space-time domain decomposition iteration, for a model advection diiusion equation in one and two dimensions. The asymptotic convergence rate is superlinear, and it is governed by the diiusion of the error across the overlap between subdomains. Hence, it depends on both the size of this overlap and the diiusion coeecient in the equation. However, it is independent of the number of ...
متن کاملoptimal boundary control for infinite variables parabolic systems with time lags given in integral form
in this paper, the optimal boundary control problem for distributed parabolic systems, involving second orderoperator with an infinite number of variables, in which constant lags appear in the integral form both in the state equations and in the boundary condition is considered. some specific properties of the optimal control arediscussed.
متن کاملSemidiscretization in Time for Parabolic Problems
We study the error to the discretization in time of a parabolic evolution equation by a single-step method or by a multistep method when the initial condition is not regular. Introduction. The problem we are considering is the parabolic evolution equation ( u'(t) + Au(t) = 0, 0<t<T, (*) I (u(0) = uo. Here, A is a linear operator, unbounded on Hubert space H, of domain D(A) dense in H; the initi...
متن کاملExtremal Problems for Geometric Hypergraphs 1 Extremal Problems for Geometric
A geometric hypergraph H is a collection of i-dimensional simplices, called hyperedges or, simply, edges, induced by some (i + 1)-tuples of a vertex set V in general position in d-space. The topological structure of geometric graphs, i.e., the case d = 2; i = 1, has been studied extensively, and it proved to be instrumental for the solution of a wide range of problems in combinatorial and compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archives of Control Sciences
سال: 2023
ISSN: ['1230-2384', '2300-2611']
DOI: https://doi.org/10.24425/119078